There are 12 parameter combinations in Table 1 of the paper. In the zip file, there are 12 data files. Each data file corresponds to one parameter combination in Table 1. The name of the data file matches the parameter combination in Table 1. 

Each data file includes the data for the problem instances generated in a parameter combination. We generated 10,000 problem instances for each parameter combination in the paper. To conserve storage, we provide the first 1,000 problem instances for each parameter combination. Each row in the data file corresponds to a different problem instance. In particular, each row specifies a problem instance as follows:

- Starting with the key word NCAP, we list the capacity available in each nest. If there are m nests, then there are m values following the key word NCAP, corresponding to the capacity available in each nest.

- Starting with the key word DIS, we list the dissimilarity parameter of each nest in the nested logit choice model. If there are m nests, then there are m values following the key word DIS, corresponding to the dissimilarity parameter of each nest.

- Starting with the key word PCAP, we list the capacity consumed by each product. If there are m nests and n products in each nest, then there are m * n values following the key word PCAP. The first value corresponds to the capacity consumption of the first product in the first nest, the second value corresponds to the capacity consumption of the second product in the first nest, etc.

- Starting with the key word RV, we list the revenue associated with each product. If there are m nests and n products in each nest, then there are m * n values following the key word RV. The first value corresponds to the revenue of the first product in the first nest, the second value corresponds to the revenue of the second product in the first nest, etc. 

- Starting with the key word CHOP, we list the preference weight of each product in the nested logit choice model. If there are m nests and n products in each nest, then there are m * n values following the key word CHOP. The first value corresponds to the preference weight of the first product in the first nest, the second value corresponds to the preference weight of the second product in the first nest, etc.

- Starting with the key word NOCP, we give the preference weight of the no-purchase option.